Networks and Morphophonemic Rules Revisited
نویسندگان
چکیده
In the debate over the power of connectionist models to handle linguistic phenomena, considerable attention has been focused on the learning of simple morphophonemic rules. Rumelhart and McClelland’s celebrated model of the acquisition of the English past tense (1986), which used a simple pattern associator to learn mappings from stems to past tense forms, was advanced as evidence that networks could learn to emulate rule-like linguistic behavior. Pinker and Prince’s equally celebrated critique of the past-tense model (1988) argued forcefully that the model was inadequate on several grounds. For our purposes, these are (1)ּthe fact that the model is not constrained in ways that humans language learners clearly are and (2)ּthe fact that, since the model cannot represent the notion “word”, it cannot distinguish homophonous verbs. A further deficiency of the model, one not brought out by Pinker and Prince, is that it is not a processing account: the task that the network learns is that of associating forms with forms rather than that of producing forms given meanings or meanings given forms. This paper describes a connectionist model which addresses all three objections to the earlier work on morphophonemic rule acquisition. The model learns to generate forms in one or another “tense”, given arbitrary patterns representing “meanings”, and to output the appropriate tense given forms. The inclusion of meanings in the network means that homophonous forms are distinguished. In addition, this network experiences difficulty learning reversal processes which do not occur in human language.
منابع مشابه
A Word Grammar of Turkish with Morphophonemic Rules
A WORD GRAMMAR OF TURKISH WITH MORPHOPHONEMIC RULES Oztaner, Serdar Murat M.S., Department of Computer Engineering Supervisor: Assist. Prof. Dr. Cem Boz sahin January 1996, 128 pages This thesis is about the computational morphological analysis and generation of Turkish word forms. Turkish morphological description is encoded using the two-level morphological model. This description consists ...
متن کاملLearning Morphophonemic Processes without Underlying Representations and Explicit Rules
Traditional phonology presupposes abstract underlying representations (UR) and a set of rules to explain the phonological phenomena. There are, however, a number of questions that have been raised regarding this approach : Where do URs come from? How are rules found and related to each other? In the current study, a connectionist network was trained without the benefit of any UR and explicit ru...
متن کاملA Short-Term Memory Architecture for the Learning of Morphophonemic Rules
Despite its successes, Rumelhart and McClelland's (1986) well-known approach to the learning of morphophonemic rules suffers from two deficiencies: (1) It performs the artificial task of associating forms with forms rather than perception or production. (2) It is not constrained in ways that humans learners are. This paper describes a model which addresses both objections. Using a simple recurr...
متن کاملHybrid Grapheme to Phoneme Conversion forUnlimited
Both dictionary-based and rule-based methods on grapheme-to-phoneme conversion have their own advantages and limitations. For example, a large sized phonetic dictionary and complex morphophonemic rules are required for the dictionary-based method and the LTS(letter to sound) rule-based method itself cannot model the complete morphophonemic constraints. This paper describes a grapheme-to-phoneme...
متن کاملMachine Learning of Phonologically Conditioned Noun Declensions For Tamil Morphological Generators
This paper presents machine learning solutions to a practical problem of Natural Language Generation (NLG), particularly the word formation in agglutinative languages like Tamil, in a supervised manner. The morphological generator is an important component of Natural Language Processing in Artificial Intelligence. It generates word forms given a root and affixes. The morphophonemic changes like...
متن کامل